Development of materials database system for cae system of heat treatment based on data mining technology

Computer simulation for materials processing needs of materials. In order to employ the accumulated large data on a huge database containing a great deal of various physical properties materials heat treatment in the past years, it is significant to develop an intelligent database system. Based on the data mining technology for data analysis, an intelligent database web tool system of computer simulation for heat treatment process named as IndBASEweb-HT was built up. The architecture and the arithmetic of this system as well as its application were introduced.     

Adherence clustering: an efficient method for mining market-basket clusters

We explore in this paper the efficient clustering of market-basket data. Different from those of the traditional data, the features of market-basket data are known to be of high dimensionality and sparsity. Without explicitly considering the presence of the taxonomy, most prior efforts on clustering market-basket data can be viewed as dealing with items in the leaf level of the taxonomy tree. Clustering transactions across different levels of the taxonomy is of great importance for marketing strategies as well as for the result representation of the clustering techniques for market-basket data. In view of the features of market-basket data, we devise in this paper a novel measurement, called the category-based adherence, and utilize this measurement to perform the clustering. With this category-based adherence measurement, we develop an efficient clustering algorithm, called algorithm k-todes, for market-basket data with the objective to minimize the category-based adherence. The distance of an item to a given cluster is defined as the number of links between this item and its nearest tode. The category-based adherence of a transaction to a cluster is then defined as the average distance of the items in this transaction to that cluster. A validation model based on information gain is also devised to assess the quality of clustering for market-basket data. As validated by both real and synthetic datasets, it is shown by our experimental results, with the taxonomy information, algorithm k-todes devised in this paper significantly outperforms the prior works in both the execution efficiency and the clustering quality as measured by information gain, indicating the usefulness of category-based adherence in market-basket data clustering.     

运用炸药混装车技术开采堆石坝级配料

葛洲坝集团公司成功地将乳化炸药混装车技术引入三峡水电工程的土石方开挖中，取得了良好的效益，在国内还未曾有人将该技术应用于堆石坝级配料开采。本文结合清江水布垭工程爆破试验，对运用混装车技术开采堆石料进行了研究。事实证明：把混装车技术引入堆石坝级配料开采可大大提高开采强度，降低工程成本；增加细颗粒石料，优化堆石料级配；爆破效果良好，安全可靠。     

数据挖掘在现代作战中的应用研究

随着装备技术的发展,现代作战具有作战单元种类数量多、攻防战术复杂、干扰性欺骗性数据充斥等特点,尤其是协同作战能力和数据交换能力逐步增强,以上都使得现代作战中涉及的信息呈现＂海量＂特征。为了取得理想的作战效果,指挥员必须对以上海量信息进行处理,从中提取出有用的信息和知识。近年来迅速发展的数据挖掘技术,在处理海量信息方面具有非常明显的优势。文章在介绍现代作战特点和数据挖掘技术的基础上,对数据挖掘技术在现代作战中的应用做了初步的研究。     

基于Sql Server BI平台和决策树技术的CET-4成绩分析

文章首先对Sql Server 2008商业智能平台及决策树技术相关理论作了介绍,然后对挖掘数据源数据进行了一系列预处理。利用Sql Server 2008商业智能平台下的决策树技术并采用数据挖掘扩展语言即DMX语言创建了CET-4成绩分析决策树模型。分类矩阵和挖掘提升图分别对该模型的评估结果表明了模型具有较高的可靠性和分类准确度,同时模型对应的一些规则可作为英语教学管理和改革的重要参考依据。     

基于间接关联规则的数据挖掘算法研究

简单数据集可以通过关联规则得到在数据间的相互关系;相当多的情况下,由于不能从关联规则得到隐藏在数据间的相互关系,需要按间接关联规则分析出数据项集在交易集合中出现的频度,挖掘隐藏在数据间的相互关系。文中通过使用概念分层和基于近邻的方法,探讨利用FP树产生的频繁项集,对候选关联检验其是否满足项对支持度条件,并利用这个频繁项集挖掘事务的间接关联,找到挖掘事务的间接关联的内在规律,构造出不依赖中介条件的间接关联挖掘算法。     

数据挖掘课程案例教学研究

数据挖掘是一门交叉性学科,是情报学专业的重要课程之一。它主要介绍数据挖掘的基本概念、原理、方法和技术,涉及多个学科和算法因而教学难度较大。由于数据挖掘学科交叉性强涉及的挖掘方法和相关算法多并繁杂,造成学生对数据挖掘的整体工作流程缺乏了解形成“不识庐山真面目只缘身在此山中”现象。文中以时间序列服装销售额预测挖掘项目为教学案例让学生首先掌握数据挖掘的标准流程,重点讲解用到的相关挖掘方法和算法及其在实际挖掘环境中的开发方法,达到“会当I临绝顶一览众山小”的教学目标。通过教学实践教学效果良好。     

面向服务的云数据挖掘引擎的研究

数据挖掘算法处理海量数据时,扩展性受到制约。在商业和科学研究的各个领域,知识发现的过程和需求差异较大,需要有效的机制来设计和运行各种类型的分布式数据挖掘应用。提出了一种面向服务的云数据挖掘引擎的框架CloudDM。不同于基于网格的分布式数据挖掘框架,CloudDM利用开源云计算平台Hadoop处理海量数据的能力,以面向服务的形式支持分布式数据挖掘应用的设计和运行,并描述面向服务的云数据挖掘引擎系统的关键部件和实现技术。依据面向服务的软件体系结构和基于云平台的数据挖掘引擎,可以有效解决海量数据挖掘中的海量数据存储、数据处理和数据挖掘算法互操作性等问题。     

A new algorithm for fast mining frequent itemsets using N-lists

Mining frequent itemsets has emerged as a fundamental problem in data mining and plays an essential role in many important data mining tasks.In this paper,we propose a novel vertical data representation called N-list,which originates from an FP-tree-like coding prefix tree called PPC-tree that stores crucial information about frequent itemsets.Based on the N-list data structure,we develop an efficient mining algorithm,PrePost,for mining all frequent itemsets.Efficiency of PrePost is achieved by the following three reasons.First,N-list is compact since transactions with common prefixes share the same nodes of the PPC-tree.Second,the counting of itemsets’ supports is transformed into the intersection of N-lists and the complexity of intersecting two N-lists can be reduced to O(m + n) by an efficient strategy,where m and n are the cardinalities of the two N-lists respectively.Third,PrePost can directly find frequent itemsets without generating candidate itemsets in some cases by making use of the single path property of N-list.We have experimentally evaluated PrePost against four state-of-the-art algorithms for mining frequent itemsets on a variety of real and synthetic datasets.The experimental results show that the PrePost algorithm is the fastest in most cases.Even though the algorithm consumes more memory when the datasets are sparse,it is still the fastest one.     

矿井提升机常见故障分析

介绍矿井提升机的常见故障及分类。